A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids
نویسندگان
چکیده
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a square rhomboid that is an example of non-seriesparallel graphs. Our intention is to simplify the expressions of square rhomboids and eventually find their shortest representations. With that end in view, we describe the new algorithm for generating square rhomboid expressions, which improves on our previous algorithms.
منابع مشابه
Full Square Rhomboids and Their Algebraic Expressions
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a full square rhomboid that is an example of non-series-parallel graphs. Our intention is to simplify the expressions of full square rhomboids and eventually find their shortest representations. With that end in view, we describe two decomposition methods for generating expressions of full...
متن کاملThe Uniform Generalized Decomposition Method for Generating Algebraic Expressions of Fibonacci Graphs
The paper investigates relationship between algebraic expressions and Fibonacci graphs (which give a generic example of non-series-parallel graphs). We propose the uniform generalized decomposition method for constructing Fibonacci graph expressions. On every step this method divides the graph of size n into k parts of the same size. We prove that to reach the smallest possible length of the co...
متن کاملOn the Optimal Representation of Algebraic Expressions of Fibonacci Graphs
The paper investigates relationship between algebraic expressions and graphs. We consider a digraph called a Fibonacci graph which gives a generic example of non-series-parallel graphs. Our intention in this paper is to simplify the expressions of Fibonacci graphs and eventually find their shortest representations. With that end in view, we describe the optimal decomposition method for generati...
متن کاملExact solution of two classes of prudent polygons
Prudent walks are self-avoiding walks on a lattice which never step into the direction of an already occupied vertex. We study the closed version of these walks, called prudent polygons, where the last vertex of the walk is adjacent to its first one. More precisely, we give the half-perimeter generating functions of two subclasses of prudent polygons on the square lattice, which turn out to be ...
متن کاملOn Triangulations with High Vertex Degree
We solve three enumerative problems concerning the families of planar maps. More precisely, we establish algebraic equations for the generating function of loopless triangulations in which all vertices have degree at least d, for a certain value d chosen in {3, 4, 5}. The originality of the problem lies in the fact that degree restrictions are placed both on vertices and faces. Our proofs first...
متن کامل